Strong S-equivalence of Ordered Links
نویسنده
چکیده
Recently Swatee Naik and Theodore Stanford proved that two Sequivalent knots are related by a finite sequence of doubled-delta moves on their knot diagrams. We show that classical S-equivalence is not sufficient to extend their result to ordered links. We define a new algebraic relation on Seifert matrices, called Strong S-equivalence, and prove that two oriented, ordered links L and L are related by a sequence of doubled-delta moves if and only if they are Strongly S-equivalent. We also show that this is equivalent to the fact that L can be obtained from L through a sequence of Y-clasper surgeries, where each clasper leaf has total linking number zero with L.
منابع مشابه
Classification of Links up to Self #-move
A pass-move and a #-move are local moves on oriented links defined by L.H. Kauffman and H. Murakami respectively. Two links are self pass-equivalent (resp. self #-equivalent) if one can be deformed into the other by pass-moves (resp. #-moves), where non of them can occur between distinct components of the link. These relations are equivalence relations on ordered oriented links and stronger tha...
متن کاملWeak Order Equivalence for Logic Programs with Preferences
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimization. In [9], the novel notion of strong equivalence for logic programs with rule preferences (so-called ordered logic programs) has been defined and necessary and sufficient conditions for programs being strongly equiv...
متن کاملReal Coboundaries for Minimal Cantor Systems
In this paper we investigate the role of real-valued coboundaries for classifying of minimal homeomorphisms of the Cantor set. This work follows the work of Giordano, Putnam, and Skau who showed that one can use integer-valued coboundaries to characterize minimal homeomorphisms up to strong orbit equivalence. First, we prove a rigidity result. We show that there is an orbit equivalence between ...
متن کاملNotions of Strong Equivalence for Logic Programs with Ordered Disjunction
Ordered disjunctions have been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. The semantics for the resulting language is based on the answer-set semantics, but comes in different variants, depending on the particular interpretation of preference aggregation associated to the ordered disjunction connective. While in standard a...
متن کاملOn L-spaces and Left-orderable Fundamental Groups
Examples suggest that there is a correspondence between L-spaces and 3manifolds whose fundamental groups cannot be left-ordered. In this paper we establish the equivalence of these conditions for several large classes of such manifolds. In particular, we prove that they are equivalent for any closed, connected, orientable, geometric 3-manifold that is non-hyperbolic, a family which includes all...
متن کامل